Globalizing fibrations by schedules
نویسندگان
چکیده
منابع مشابه
Diagonal Fibrations Are Pointwise Fibrations
On the category of bisimplicial sets there are different Quillen closed model structures associated to various definitions of fibrations. In one of them, which is due to Bousfield and Kan and that consists of seeing a bisimplicial set as a simplicial object in the category of simplicial sets, fibrations are those bisimplicial set maps such that each of the induced simplicial set maps is a Kan f...
متن کاملGlobalizing Domain - Specific Languages
This report documents the program and the outcomes of the Dagstuhl Seminar 14412 “Globalizing Domain-Specific Languages” held in October 2014. Complex, data-intensive, cyber-physical, cloud-based etc. systems need effective modeling techniques, preferably based on DSLs to describe aspects and views. Models written in heterogeneous languages however need to be semantically compatible and their s...
متن کاملCalibrated Fibrations
In this paper we investigate the geometry of Calibrated submanifolds and study relations between their moduli-space and geometry of the ambient manifold. In particular for a Calabi-Yau manifold we define Special Lagrangian submanifolds for any Kahler metric on it. We show that for a choice of Kahler metric the Borcea-Voisin threefold has a fibration structure with generic fiber being a Special ...
متن کاملResolutions of Spaces by Cubes of Fibrations
J.-L. Loday has used w-cubes of fibrations, where n is a non-negative integer, in his study of spaces with finitely many non-trivial homotopy groups [4]. His main result is the construction of an algebraic category equivalent to the weak homotopy category of path-connected spaces Z with TI^Z = 0 for / > w+1 [4, 1.7]. One step in the proof [4, 3.5] requires the construction of certain «-cubes of...
متن کاملGlobalizing Stabilized Sqp by Smooth Primal-dual Exact Penalty Function
An iteration of the stabilized sequential quadratic programming method (sSQP) consists in solving a certain quadratic program in the primal-dual space, regularized in the dual variables. The advantage with respect to the classical sequential quadratic programming (SQP) is that no constraint qualifications are required for fast local convergence (i.e., the problem can be degenerate). In particul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Mathematicae
سال: 1988
ISSN: 0016-2736,1730-6329
DOI: 10.4064/fm-130-2-125-136